Interior points of the completely positive cone
نویسندگان
چکیده
A matrix A is called completely positive if it can be decomposed as A = BBT with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone which plays a role in certain optimization problems. A characterization of the interior of this cone is provided.
منابع مشابه
Ela an Improved Characterisation of the Interior of the Completely Positive Cone
A symmetric matrix is defined to be completely positive if it allows a factorisation BB , where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems. The interior of the completely positive cone has previously been characterised by Dür and Still [M. Dür and G. Still, Interior points of the completely positive cone, Electronic Journal of Linear Algebra, 17:48...
متن کاملAn improved characterisation of the interior of the completely positive cone
A symmetric matrix is defined to be completely positive if it allows a factorisation BB , where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems. The interior of the completely positive cone has previously been characterised by Dür and Still [M. Dür and G. Still, Interior points of the completely positive cone, Electronic Journal of Linear Algebra, 17:48...
متن کاملA Short Note on the Interior of the Completely Positive Cone
A symmetric matrix is defined to be completely positive if it allows a factorisation BB , where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems. The interior of the completely positive cone has previously been characterised by Dür and Still [7]. In this paper we introduce the concept of the set of zeros in the nonnegative orthant for a quadratic form an...
متن کاملOn the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings
The structural properties of the completely positive semidefinite cone CS+, consisting of all the n×n symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size, are investigated. This cone has been introduced to model quantum graph parameters as conic optimization problems. Recently it has also been used to characterize the set Q of bipartite quantum corr...
متن کاملSolving SDP Completely with an Interior Point Oracle
We suppose the existence of an oracle which is able to solve any semidefinite programming (SDP) problem having interior feasible points at both its primal and dual sides. We note that such an oracle might not be able to directly solve general SDPs even after certain regularization schemes such as facial reduction or Ramana’s dual are applied. The main objective of this work is to fill this gap ...
متن کامل